搜索资源列表
jmsnqueens
- n queens backtracking
DancingLinks
- 在计算机科学，舞蹈链接，也被称为的DLx ，是技术建议唐纳德克努特有效地执行其算法十算法X是递归，随意性，深度优先，回溯算法，认为所有的解决方案的确切覆盖问题。一些较为著名的确切涵盖的问题包括瓦工，n皇后问题，数独。-In computer science, Dancing Links, also known as DLX, is the technique suggested by Donald Knuth to efficiently implement his Algorithm X. A
nqueen
- 该程序利用C++环境，实现了N皇后问题。当输入的皇后个数是13时，运行速度还相当可以。当个数增加到14的时候，运行速度就相对慢了下来，不过运行出正确的结果是没有问题的。-This process uses the c++ circumstance,and it accomplished the N Queens problem.when the input number is 13,the running speed is at a fairly rapid pace.when the inpu
simulated_annealing
- Population-based Simulated Annealing Implementation for n-Queens (UNIX/ C)-Population-based Simulated Annealing Implementation for n-Queens (UNIX/C)
FourQueen
- N皇后问题的解决方案,利用回归的方法.方法易懂-N Queens solution to the problem, using regression. Methods to understand
NQueens
- 利用回溯算法求解n皇后问题；并通过本例熟悉回溯算法在程序设计中的应用方法。-The use of backtracking algorithm to solve n queens problem and are familiar with the passage of the cases of backtracking algorithm in the program design should be applied.
NQN
- N queens problem solution in C
las
- 使用拉斯维加斯随机算法解决N皇后问题 可以以较快速度解决128皇后 甚至是256皇后问题-Use Las Vegas randomized algorithm to solve the N Queens problem can be resolved more rapid pace of 128 or even 256 Queen Queens Problem
classic_Problem_algorithm
- 包含几个经典问题算法，如骑士遍历，N皇后问题回溯等。对这些算法有兴趣的可以一看。-Algorithm contains several classic problems, such as the Knight traversal, N queens problem back and so on. Are interested in these algorithms can have a look.
Nqueensprobleseekingbackrackingalgorithmusingfromt
- 求 N 皇后问题回溯算法，用从C语言编写的。希望对大家有所帮助！-N queens problem seeking backtracking algorithm, using from the C language. We want to help!
Nqueensprobleseekingbackrackingalgorith
- n皇后问题回溯算法，用C语言编写的！希望对大家有所帮助！-n queens problem backtracking algorithm, written using C language! We want to help!
queen
- 用回溯法的思想解答 n皇后问题，掌握使用回溯法求解问题的基本思路-The idea with backtracking to answer n queens problem, master the use of backtracking to solve the problem of the basic ideas
wu
- 掌握使用回溯法求解问题的基本思路，用回朔法做n皇后问题-Use backtracking to solve the problem to master the basic ideas, with the retrospective method to do the n queens problem
nprime
- N Prime问题也可以成为N皇后问题，此算法这是回溯法,非递归实现.-N Prime problem can also be N Queens problem, this algorithm is backtracking, non-recursive implementation.
wtsf.tgz
- N皇后问题回溯算法.c 货郎担分枝限界图形演示.c 矩阵乘法动态规划.c 万年历 动态计算网络最长最短路线.c 货郎担限界算法.c 骑士遍历 网络最短路径Dijkstra算法.c-N queens problem backtracking algorithm. C TSP branch and bound graphical presentation. C matrix multiplication, dynamic programming. C calendar dynamic compu
queen
- ｎ个皇后问题 在 n 行 n 列的国际象棋棋盘上，最多可布n个皇后。若两个皇后位于同一行、同一列、同一对角线上，则称为它们为互相攻击。 n皇后问题是指找到这 n 个皇后的互不攻击的布局。-n-Queens problem in n rows n columns of the chess board, up to n-Queens cloth. If the two Queens in the same row, same column, the same diagonal, then c
NQueue
- 利用回溯法求解N皇后问题及其算法性能分析。-The use of backtracking algorithms for solving N Queens problem and its performance analysis.
8queen
- 通过遗传算法求解N皇后问题，用c++编写-Through the Genetic Algorithm for N queens problem, using c++ write
nqueen
- 经典的N皇后问题，使用C++6.0开发，很好的-Classic N-Queens problem, the use of C++6.0 development, good
LPTc
- 8皇后问题，N皇后问题，随机算法，提高速度-this is a randomized solution of N Queens. with random algrithism, we can improve the speed of finding solution